class Solution
{
public:
    vector<vector<int>> findContinuousSequence(int target)
    {
        vector<vector<int>> result;
        for (long long i = 1; i <= target / 2; ++i)
        {
            double len = 0.5 * (1 - 2 * i + sqrt((2 * i - 1) * (2 * i - 1) + 8 * target));
            if (len > 1 && len == floor(len))
            {
                int iLen = len;
                result.push_back({});
                for (int num = i; num < i + len; ++num)
                {
                    result.back().push_back(num);
                }
            }
        }
        return result;
    }
};